Distributed Computations Driven by Resource Consumption
نویسندگان
چکیده
Millions of computers are now connected together by the Internet. At a fast pace, applications are taking advantage of these new capabilities, and are becoming parallel and distributed, e.g. applets on the WWW or agent technology. As we live in a world with finite resources, an important challenge is to be able to control computations in such an environment. For instance, a user might like to suspend a computation because another one seems to be more promising. In this paper, we present a paradigm that allows the programmer to monitor and control computations, whether parallel or distributed, by mastering their resource consumption. We describe an implementation on top of the thread library PPCR and the message-passing library Nexus.
منابع مشابه
Design and Semantics of Quantum: A Language to Control Resource Consumption in Distributed Computing
This paper describes the semantics of Quantum, a language that was speci cally designed to control resource consumption of distributed computations, such as mobile agent style applications. In Quantum, computations can be driven by mastering their resource consumption. Resources can be understood as processors cycles, geographical expansion, bandwidth or duration of communications, etc. We adop...
متن کاملDesign and Semantics of Quantum : a Language to
This paper describes the semantics of Quantum, a language that was speciically designed to control resource consumption of distributed computations , such as mobile agent style applications. In Quantum, computations can be driven by mastering their resource consumption. Resources can be understood as processors cycles, geographical expansion , bandwidth or duration of communications, etc. We ad...
متن کاملDynamic Scheduling of Distributed Method Invocations
Distributed method invocations require dynamic scheduling algorithms and efficient resource projections to provide timeliness guarantees to application objects. In this paper we present a dynamic scheduling algorithm that examines the computation times, real times and resource requirements of the application tasks to determine a feasible schedule for the method invocations. The schedule is driv...
متن کاملAn Evaluation of Economy-based Resource Trading and Scheduling on Computational Power Grids for Parameter Sweep Applications
Computational Grids are becoming attractive and promising platforms for solving large-scale (problem solving) applications of multi-institutional interest. However, the management of resources and scheduling computations in the Grid environment is a complex undertaking as they are (geographically) distributed, heterogeneous in nature, owned by different individuals or organisations with their o...
متن کاملRobot-Beacon Distributed Range-Only SLAM for Resource-Constrained Operation
This work deals with robot-sensor network cooperation where sensor nodes (beacons) are used as landmarks for Range-Only (RO) Simultaneous Localization and Mapping (SLAM). Most existing RO-SLAM techniques consider beacons as passive devices disregarding the sensing, computational and communication capabilities with which they are actually endowed. SLAM is a resource-demanding task. Besides the t...
متن کامل